منابع مشابه
Generalizations of Interval Graphs
Interval graphs arose in the nineteen fifties and have become a staple of graph theory, both for their appealing applications and for their rich mathematical structure yielding elegant characterizations and efficient algorithms. Recently, interval graphs have naturally appeared in the context of constraint satisfaction problems. Progress in understanding what structures make CSP’s tractable sug...
متن کاملOpen - Interval Graphs versus Closed - Interval Grap
A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--*F such that uv ~ E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. S...
متن کاملk - Interval - filament graphs
For a fixed k, an oriented graph is k-transitive if it is acyclic and for every directed path p=u1→u2→...→uk+2 with k+2 vertices, p induces a clique if each of the two subpaths u1→u2→...→uk+1 and u2→...→uk+2 induces a clique. We describe an algorithm to find a maximum weight clique in a k-transitive graph. Consider a hereditary family G of graphs. A graph H(V,E) is called G-k-mixed if its edge ...
متن کاملSimultaneous Interval Graphs
In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G1 and G2, sharing some vertices I (and the corresponding induced edges), are said to be “simultaneous interval graphs” if there exist interv...
متن کاملGossiping on Interval Graphs
We present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; diierent nodes have transceivers with diierent ranges. We assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, we assume that all nodes within ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90206-w